Towards Resource Usage Analysis of MiniZinc Models

نویسندگان

  • F. Bueno
  • Maria Garcia de la Banda
  • M. V. Hermenegildo
  • P. Lopez-Garcia
  • E. Mera
  • P. J. Stuckey
چکیده

We present a method for the static resource usage analysis of MiniZinc models. The analysis can infer upper bounds on the usage that a MiniZinc model will make of some resources such as the number of constraints of a given type (equality, disequality, global constraints, etc.), the number of variables (search variables or temporary variables), or the size of the expressions before calling the solver. These bounds are obtained from the models independently of the concrete input data (the instance data) and are in general functions of sizes of such data. In our approach, MiniZinc models are translated into Ciao programs which are then analysed by the CiaoPP system. CiaoPP includes a parametric analysis framework for resource usage in which the user can define resources and express the resource usage of library procedures (and certain program constructs) by means of a language of assertions. We present the approach and report on a preliminary implementation, which shows the feasibility of the approach, and provides encouraging results.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

MiniZinc: Towards a Standard CP Modelling Language

There is no standard modelling language for constraint programming (CP) problems. Most solvers have their own modelling language. This makes it difficult for modellers to experiment with different solvers for a problem. In this paper we present MiniZinc, a simple but expressive CP modelling language which is suitable for modelling problems for a range of solvers and provides a reasonable compro...

متن کامل

Embedding MiniZinc?

MiniZinc is an expressive, mid-level modelling language for combinatorial optimisation problems. Its main advantage over other modelling languages and systems is the approach towards solver-independent modelling: it comes with an extensive library of global constraints that are supported by all MiniZinc-compatible solvers – either through decomposition, or as a native builtin constraint of the ...

متن کامل

Improved Linearization of Constraint Programming Models

Constraint Programming (CP) standardizes many specialized “global constraints” allowing high-level modelling of combinatorial optimization and feasibility problems. Current Mixed-Integer Linear Programming (MIP) technology lacks both a modelling language and a solving mechanism based on high-level constraints. MiniZinc is a solver-independent CP modelling language. The solver interface works by...

متن کامل

The MiniZinc Challenge 2008-2013

set of MiniZinc models and problems instances. MiniZinc1 (Nethercote et al. 2007) was our response to the call for a standard constraint-programming modeling language. MiniZinc is high level enough to express most combinatorial optimization problems easily and in a largely solverindependent way; for example, it supports sets, arrays, and user-defined predicates, some overloading, and some autom...

متن کامل

On Translating MiniZinc Constraint Models into Fitness Functions for Evolutionary Algorithms: Application to Continuous Placement Problems

MiniZinc is a solver-independent constraint modeling language which is increasingly used in the constraint programming community. It can be used to compare different solvers which are currently based on either constraint programming, Boolean satisfiability or mixed integer linear programming. In this paper we show how MiniZinc models can be compiled into fitness functions for evolutionary algor...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2011